Towards Better Workflow Execution Time Estimation
نویسندگان
چکیده
منابع مشابه
Towards Better Workflow Execution Time Estimation
Authors highlight the importance of estimating workflow execution time in the scheduling problem and in pricing models in Clouds. Claim that better approaches need to be developed to obtain precise estimates of execution time. Describe straightforward regression for stochastic execution time estimation. Propose a combination of Chebyshev-like distribution-free inequalities and distribution-base...
متن کاملCloud Workload Prediction based on Workflow Execution Time Discrepancies
Infrastructure as a service clouds hide the complexity of maintaining the physical infrastructure with a slight disadvantage: they also hide their internal working details. Should users need knowledge about these details e.g., to increase the reliability or performance of their applications, they would need solutions to detect behavioural changes in the underlying system. Existing runtime solut...
متن کاملTowards Real-Time Execution of Motion Tasks
The goal of the research described in this paper is to build robotic systems that can execute motion tasks in real time. We present two ideas towards this goal: a real-time path planner for static three-dimensional con guration spaces and a new framework for the integration of planning and control. The planner is based on a new class of cells, slippery cells, incorporated in an approximate cell...
متن کاملAn Abstract Machine for Execution Time Estimation
ion Level The (Fortran) abstraction level used is too high to produce exact estimations of execution times. It is adequate nonetheless for identifying trends in the execution time caused by fluctuations in input parameters of the application being examined, and the machine model parameters. Non-Orthogonal Parameters Many of the parameters depend on each other, while it is not specifically menti...
متن کاملAnalyzing Loop Paths for Execution Time Estimation
Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level due to the inherent difficulty in detecting infeasible paths in a program’s control flow graph. In this paper, we study the problem of accurately bounding the execution time of a program loop. This involves infeasible path detect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IERI Procedia
سال: 2014
ISSN: 2212-6678
DOI: 10.1016/j.ieri.2014.09.080